Layered Data: A Modular Formal Definition without Formalisms

نویسندگان

  • Alban Linard
  • Benoît Barbot
  • Didier Buchs
  • Maximilien Colange
  • Clément Démoulins
  • Lom-Messan Hillah
  • Alexis Martin
چکیده

Defining formalisms and models in a modular way is a painful task. Metamodeling tools and languages have usually not been created with this goal in mind. This article proposes a data structure, called layered data, that allows defining easily modular abstract syntax for formalisms and models. It also shows its use through an exhaustive example. As a side effect, this article discusses the notion of formalism, and asserts that they do not exist as standalone objects, but rather as relations between models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems

Over the past two decades, numerous verification tools have been successfully used for verifying complex concurrent systems, modelled using various formalisms. However, it is still hard to coordinate these tools since they rely on such a large number of formalisms. Having a proper syntactical mechanism to interrelate them through variability would increase the capability of effective integrated...

متن کامل

Description Logic and Faceted Knowledge Representation

The term ”facet” was introduced into the field of library classification systems by Ranganathan in the 1930’s [Ranganathan, 1962]. A facet is a viewpoint or aspect. In contrast to traditional classification systems, faceted systems are modular in that a domain is analyzed in terms of baseline facets which are then synthesized. In this paper, the term ”facet” is used in a broader meaning. Facets...

متن کامل

A layered algorithm for quantifier elimination from linear modular constraints

Linear equalities, disequalities and inequalities on fixed-width bit-vectors, collectively called linear modular constraints, form an important fragment of the theory of fixedwidth bit-vectors. We present a practically efficient and bit-precise algorithm for quantifier elimination from conjunctions of linear modular constraints. Our algorithm uses a layered approach, whereby sound but incomplet...

متن کامل

jMosel: A Flexible Tool-Set for Monadic Second-Order Logic on Strings

jMosel is a tool-set for the analysis and verification of linear parametric systems in monadic second-order logic on strings. In this paper we concentrate on the presentation of the core tool which supports several input and output formats as well as the interchange of the tool-set’s internal components. The main design principles of jMosel are its layered approach to the logic, the definition ...

متن کامل

Concepts and architecture of a simulation framework based on the JavaBeans component model

We report on a combination of system theoretic simulation modeling methodology with the JavaBeans component model as a basis for a component-based simulation framework. While system theory formalisms can serve as formal, mathematical foundations for modular, hierarchical modeling and simulation, the JavaBeans component model provides the appropriate implementation base. The result of the synerg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016